Characterising Strongly Normalising Intuitionistic Terms
نویسندگان
چکیده
منابع مشابه
Characterising Strongly Normalising Intuitionistic Terms
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. Next...
متن کاملCharacterising Strongly Normalising Intuitionistic Sequent Terms
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper...
متن کاملCharacterisation of Strongly Normalising lambda-mu-Terms
We provide a characterisation of strongly normalising terms of the λμ-calculus by means of a type system with intersection and product types. The presence of the latter and a restricted use of the type ω enable us to represent the particular notion of continuation used in the literature for the definition of semantics for the λμ-calculus. This makes it possible to lift the well-known characteri...
متن کاملComplexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
We present a typing system for the λ-calculus, with non-idempotent intersection types. As it is the case in (some) systems with idempotent intersections, a λ-term is typable if and only if it is strongly normalising. Nonidempotency brings some further information into typing trees, such as a bound on the longest β-reduction sequence reducing a term to its normal form. We actually present these ...
متن کاملYet another normalisation proof for Martin-Lof's logical framework--Terms with correct arities are strongly normalising
In this paper, we prove the strong normalisation for Martin-L\"{o}f's Logical Framework, and suggest that {}``correct arity'', a condition weaker than well-typedness, will also guarantee the strong normalisation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2012
ISSN: 0169-2968
DOI: 10.3233/fi-2012-772